منابع مشابه
The Attack as Intuitionistic Negation
We translate the argumentation networks A = (S,R) into a theory ∆A of intuitionistic logic, retaining S as the domain and using intuitionistic negation to model the attack R in A: the attack xRy is translated to x → ¬y. The intuitionistic models of ∆A characterise the complete extensions of A. The reduction of argumentation networks to intuitionistic logic yields, in addition to a representatio...
متن کاملOn Paraconsistent Weakening of Intuitionistic Negation
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion and additivity for distributive lattices. However, according to [3], those systems turned out to be not paraconsistent but extensions of intuitionistic logic. Ta...
متن کاملParaconsistent Logic and Weakening of Intuitionistic Negation
A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. In an earlier paper [Notre Dame J. Form. Log. 49 (2008), 401–424], we developed the systems of weakening of intuitionistic negation logic, called Zn and CZn, in the spirit of da Costa’s approach by preserving, differently from da Costa, the fundamental properties of negation: antitonici...
متن کاملSemi-intuitionistic Logic with Strong Negation
There is a well known interplay between the study of algebraic varieties and propositional calculus of various logics. Prime examples of this are boolean algebras and classical logic, and Heyting algebras and intuitionistic logic. After the class of Heyting algebras was generalized to the semi-Heyting algebras by H. Sankappanavar in [San08], its logic counterpart was developed by one of us in [...
متن کاملAdding Negation-as-Failure to Intuitionistic Logic Programming
Intuitionistic logic programming is an extension of Horn-clause logic programming in which implications may appear “embedded” on the right-hand side of a rule. Thus, rules of the form A(x) ← [B(x) ← C(x)] are allowed. These rules are called embedded implications. In this paper, we develop a language in which negationas-failure is combined with embedded implications in a principled way. Although...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1971
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894217